Positivity of second order linear recurrent sequences
نویسندگان
چکیده
We give an elementary proof for the Positivity Problem for second order recurrent sequences: it is decidable whether or not a recurrent sequence defined by un = aun−1 + bun−2 has only nonnegative terms.
منابع مشابه
A Recurrent Neural Network Model for Solving Linear Semidefinite Programming
In this paper we solve a wide rang of Semidefinite Programming (SDP) Problem by using Recurrent Neural Networks (RNNs). SDP is an important numerical tool for analysis and synthesis in systems and control theory. First we reformulate the problem to a linear programming problem, second we reformulate it to a first order system of ordinary differential equations. Then a recurrent neural network...
متن کاملPositivity Problems for Low-Order Linear Recurrence Sequences
We consider two decision problems for linear recurrence sequences (LRS) over the integers, namely the Positivity Problem (are all terms of a given LRS positive?) and the Ultimate Positivity Problem (are all but finitely many terms of a given LRS positive?). We show decidability of both problems for LRS of order 5 or less, with complexity in the Counting Hierarchy for Positivity, and in polynomi...
متن کاملThe Positivity Set of a Recurrence Sequence
We consider real sequences (fn) that satisfy a linear recurrence with constant coefficients. We show that the density of the positivity set of such a sequence always exists. In the special case where the sequence has no positive dominating characteristic root, we establish that the density is positive. Furthermore, we determine the values that can occur as density of such a positivity set, both...
متن کاملNonstandard explicit third-order Runge-Kutta method with positivity property
When one solves differential equations, modeling physical phenomena, it is of great importance to take physical constraints into account. More precisely, numerical schemes have to be designed such that discrete solutions satisfy the same constraints as exact solutions. Based on general theory for positivity, with an explicit third-order Runge-Kutta method (we will refer to it as RK3 method) pos...
متن کاملEffective Positivity Problems for Simple Linear Recurrence Sequences
We consider two computational problems for linear recurrence sequences (LRS) over the integers, namely the Positivity Problem (determine whether all terms of a given LRS are positive) and the effective Ultimate Positivity Problem (determine whether all but finitely many terms of a given LRS are positive, and if so, compute an index threshold beyond which all terms are positive). We show that, f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 154 شماره
صفحات -
تاریخ انتشار 2006